Heuristics for scheduling I/O operations
نویسندگان
چکیده
منابع مشابه
Heuristics for Scheduling I/O Operations
The I/O bottleneck in parallel computer systems has recently begun receiving increasing interest. Most attention has focused on improving the performance of I/O devices using fairly low-level parallelism in techniques such as disk striping and interleaving. Widely applicable solutions, however, will require an integrated approach which addresses the problem at multiple system levels, including ...
متن کاملTechniques for cash management in scheduling manufacturing operations
The objective in traditional scheduling is usually time based. Minimizing the makespan, total flow times, total tardi costs, etc. are instances of these objectives. In manufacturing, processing each job entails a cost paying and price receiving. Thus, the objective should include some notion of managing the flow of cash. We have defined two new objectives: maximization of average and minimum av...
متن کاملNew Heuristics for Rotation Scheduling
For an iterative process to be parallelized, the operations that comprise the process must be organized into a correct schedule that will allow the hardware to compute the task. The focus of our research is rotation scheduling, a list-scheduling-based method for producing compact, static schedules for iterative processes on parallel hardware. We present three new heuristics based on rotation sc...
متن کاملSome heuristics for the hybrid flow shop scheduling problem with setup and assembly operations
Article history: Received January 2 2013 Received in revised format March 14 2013 Accepted March 14 2013 Available online March 15 2013 This paper presents a two-stage hybrid flow shop scheduling problem with setup and assembly operations. The proposed study of this paper considers one kind of product with a quantity of demand where each product is made by assembling a set of different parts. A...
متن کاملHeuristics for Flow Shop Scheduling with Multiple Operations and Time Lags
This paper considers a multistage flow shop where jobs require multiple operations at each stage and a finish-to-start time lag between any two consecutive operations of a job: the next operation of a job cannot start until the time lag after the former operation of that job has elapsed. Since the problem of minimizing the make span is shown to be NP-hard even for the two-stage case, we present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1997
ISSN: 1045-9219
DOI: 10.1109/71.584096